0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.33	% Computer   : n013.cluster.edu
0.13/0.33	% Model      : x86_64 x86_64
0.13/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory     : 8042.1875MB
0.13/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 1200
0.13/0.33	% WCLimit    : 120
0.13/0.33	% DateTime   : Tue Jul 13 15:26:18 EDT 2021
0.13/0.33	% CPUTime    : 
0.13/0.33	% Number of cores: 8
0.13/0.34	% Python version: Python 3.6.8
0.13/0.34	# Version: 2.6rc1-ho
0.19/0.34	# No SInE strategy applied
0.19/0.34	# Trying AutoSched0 for 59 seconds
0.19/0.48	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.19/0.48	# and selection function SelectMaxLComplexAvoidPosPred.
0.19/0.48	#
0.19/0.48	# Preprocessing time       : 0.052 s
0.19/0.48	
0.19/0.48	# Proof found!
0.19/0.48	# SZS status Theorem
0.19/0.48	# SZS output start CNFRefutation
0.19/0.48	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.19/0.48	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.19/0.48	thf(def_n_is, axiom, (n_is)=(^[X435:$i, X436:$i]:(X435)=(X436)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.19/0.48	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.19/0.48	thf(def_amone, axiom, (amone)=(^[X1:$i, X2:$i > $o]:![X364:$i]:(in @ X364 @ X1=>![X366:$i]:(in @ X366 @ X1=>(X2 @ X364=>(X2 @ X366=>(X364)=(X366)))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_amone)).
0.19/0.48	thf(satz8a, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X193:$i]:in @ X193 @ nat) @ (^[X194:$i]:all_of @ (^[X4:$i]:in @ X4 @ nat) @ (^[X4:$i]:(n_is @ (n_pl @ X1 @ X194) @ (n_pl @ X1 @ X4)=>n_is @ X194 @ X4)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz8a)).
0.19/0.48	thf(satz8b, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X198:$i]:in @ X198 @ nat) @ (^[X199:$i]:amone @ nat @ (^[X4:$i]:n_is @ X1 @ (n_pl @ X199 @ X4)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz8b)).
0.19/0.48	thf(c_0_7, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.19/0.48	thf(c_0_8, axiom, (n_is)=(^[X435:$i, X436:$i]:(X435)=(X436)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.19/0.48	thf(c_0_9, axiom, (amone)=(^[X1:$i, X2:$i > $o]:![X364:$i]:(in @ X364 @ X1=>![X366:$i]:(in @ X366 @ X1=>(X2 @ X364=>(X2 @ X366=>(X364)=(X366)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_amone, c_0_7]), def_e_is])).
0.19/0.48	thf(c_0_10, plain, ![X701:$i]:(in @ X701 @ nat=>![X706:$i]:(in @ X706 @ nat=>![X707:$i]:(in @ X707 @ nat=>((n_pl @ X701 @ X706)=(n_pl @ X701 @ X707)=>(X706)=(X707))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz8a, c_0_7]), c_0_8])).
0.19/0.48	thf(c_0_11, negated_conjecture, ~(![X742:$i]:(in @ X742 @ nat=>![X748:$i]:(in @ X748 @ nat=>![X749:$i]:(in @ X749 @ nat=>![X750:$i]:(in @ X750 @ nat=>((X742)=(n_pl @ X748 @ X749)=>((X742)=(n_pl @ X748 @ X750)=>(X749)=(X750)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz8b]), c_0_7]), c_0_9]), c_0_8])).
0.19/0.48	thf(c_0_12, plain, ![X1202:$i, X1203:$i, X1204:$i]:(~in @ X1202 @ nat|(~in @ X1203 @ nat|(~in @ X1204 @ nat|((n_pl @ X1202 @ X1203)!=(n_pl @ X1202 @ X1204)|(X1203)=(X1204))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
0.19/0.48	thf(c_0_13, negated_conjecture, (in @ esk44_0 @ nat&(in @ esk45_0 @ nat&(in @ esk46_0 @ nat&(in @ esk47_0 @ nat&((esk44_0)=(n_pl @ esk45_0 @ esk46_0)&((esk44_0)=(n_pl @ esk45_0 @ esk47_0)&(esk46_0)!=(esk47_0))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])).
0.19/0.48	thf(c_0_14, plain, ![X1:$i, X4:$i, X5:$i]:((X4)=(X5)|~in @ X1 @ nat|~in @ X4 @ nat|~in @ X5 @ nat|(n_pl @ X1 @ X4)!=(n_pl @ X1 @ X5)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.19/0.48	thf(c_0_15, negated_conjecture, (esk44_0)=(n_pl @ esk45_0 @ esk47_0), inference(split_conjunct,[status(thm)],[c_0_13])).
0.19/0.48	thf(c_0_16, negated_conjecture, in @ esk47_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_13])).
0.19/0.48	thf(c_0_17, negated_conjecture, in @ esk45_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_13])).
0.19/0.48	thf(c_0_18, negated_conjecture, ![X1:$i]:((X1)=(esk47_0)|(n_pl @ esk45_0 @ X1)!=(esk44_0)|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16]), c_0_17])])).
0.19/0.48	thf(c_0_19, negated_conjecture, (esk44_0)=(n_pl @ esk45_0 @ esk46_0), inference(split_conjunct,[status(thm)],[c_0_13])).
0.19/0.48	thf(c_0_20, negated_conjecture, in @ esk46_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_13])).
0.19/0.48	thf(c_0_21, negated_conjecture, (esk46_0)!=(esk47_0), inference(split_conjunct,[status(thm)],[c_0_13])).
0.19/0.48	thf(c_0_22, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])]), c_0_21]), ['proof']).
0.19/0.48	# SZS output end CNFRefutation
0.19/0.48	# Proof object total steps             : 23
0.19/0.48	# Proof object clause steps            : 9
0.19/0.48	# Proof object formula steps           : 14
0.19/0.48	# Proof object conjectures             : 11
0.19/0.48	# Proof object clause conjectures      : 8
0.19/0.48	# Proof object formula conjectures     : 3
0.19/0.48	# Proof object initial clauses used    : 7
0.19/0.48	# Proof object initial formulas used   : 7
0.19/0.48	# Proof object generating inferences   : 2
0.19/0.48	# Proof object simplifying inferences  : 6
0.19/0.48	# Training examples: 0 positive, 0 negative
0.19/0.48	# Parsed axioms                        : 330
0.19/0.48	# Removed by relevancy pruning/SinE    : 0
0.19/0.48	# Initial clauses                      : 438
0.19/0.48	# Removed in clause preprocessing      : 144
0.19/0.48	# Initial clauses in saturation        : 294
0.19/0.48	# Processed clauses                    : 352
0.19/0.48	# ...of these trivial                  : 6
0.19/0.48	# ...subsumed                          : 27
0.19/0.48	# ...remaining for further processing  : 319
0.19/0.48	# Other redundant clauses eliminated   : 131
0.19/0.48	# Clauses deleted for lack of memory   : 0
0.19/0.48	# Backward-subsumed                    : 0
0.19/0.48	# Backward-rewritten                   : 7
0.19/0.48	# Generated clauses                    : 2872
0.19/0.48	# ...of the previous two non-trivial   : 2654
0.19/0.48	# Contextual simplify-reflections      : 0
0.19/0.48	# Paramodulations                      : 2508
0.19/0.48	# Factorizations                       : 0
0.19/0.48	# NegExts                              : 1
0.19/0.48	# Equation resolutions                 : 142
0.19/0.48	# Propositional unsat checks           : 0
0.19/0.48	#    Propositional check models        : 0
0.19/0.48	#    Propositional check unsatisfiable : 0
0.19/0.48	#    Propositional clauses             : 0
0.19/0.48	#    Propositional clauses after purity: 0
0.19/0.48	#    Propositional unsat core size     : 0
0.19/0.48	#    Propositional preprocessing time  : 0.000
0.19/0.48	#    Propositional encoding time       : 0.000
0.19/0.48	#    Propositional solver time         : 0.000
0.19/0.48	#    Success case prop preproc time    : 0.000
0.19/0.48	#    Success case prop encoding time   : 0.000
0.19/0.48	#    Success case prop solver time     : 0.000
0.19/0.48	# Current number of processed clauses  : 304
0.19/0.48	#    Positive orientable unit clauses  : 89
0.19/0.48	#    Positive unorientable unit clauses: 3
0.19/0.48	#    Negative unit clauses             : 19
0.19/0.48	#    Non-unit-clauses                  : 193
0.19/0.48	# Current number of unprocessed clauses: 2595
0.19/0.48	# ...number of literals in the above   : 9687
0.19/0.48	# Current number of archived formulas  : 0
0.19/0.48	# Current number of archived clauses   : 8
0.19/0.48	# Clause-clause subsumption calls (NU) : 12332
0.19/0.48	# Rec. Clause-clause subsumption calls : 3683
0.19/0.48	# Non-unit clause-clause subsumptions  : 23
0.19/0.48	# Unit Clause-clause subsumption calls : 4031
0.19/0.48	# Rewrite failures with RHS unbound    : 2
0.19/0.48	# BW rewrite match attempts            : 46
0.19/0.48	# BW rewrite match successes           : 6
0.19/0.48	# Condensation attempts                : 0
0.19/0.48	# Condensation successes               : 0
0.19/0.48	# Termbank termtop insertions          : 80157
0.19/0.49	
0.19/0.49	# -------------------------------------------------
0.19/0.49	# User time                : 0.137 s
0.19/0.49	# System time              : 0.011 s
0.19/0.49	# Total time               : 0.148 s
0.19/0.49	# Maximum resident set size: 2104 pages
0.19/0.49	EOF